A Decision Algorithm for Stratified Context Unification

نویسنده

  • Manfred Schmidt-Schauß
چکیده

Context uniication is a variant of second order uniication and also a generalization of string uniication. Currently it is not known whether context uniication is decidable. A specialization of context uniication is stratiied context uniication. Recently, it turned out that stratiied context uniication and one-step rewrite constraints are equivalent. This paper contains a description of a decision algorithm SCU for strat-iied context uniication, which shows decidability of stratiied context uni-cation as well as of satissability of one-step rewrite constraints.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stratified Context Unification Is NP-Complete

Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for every second-order variable X, the abstraction λx.r instantiated for X has exactly one occurrence of the bound variable x in r. Stratified Context Unification is a specialization where the nesting of second-order varia...

متن کامل

On the complexity of Bounded Second-Order Unification and Stratified Context Unification

Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...

متن کامل

On the Complexity of Bounded Second-order Unification and Stratified Context Unification

Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...

متن کامل

On the complexity of Bounded Second-Order Unification and Stratified Context Unification

Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...

متن کامل

On the complexity of Bounded Second-Order Unification and Stratified Context Unification

Bounded Second-Order Unification is a decidable variant of undecidable Second-Order Unification. Stratified Context Unification is a decidable restriction of Context Unification, whose decidability is a long-standing open problem. This paper is a join of two separate previous, preliminary papers on NP-completeness of Bounded Second-Order Unification and Stratified Context Unification. It clarif...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Log. Comput.

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2002